A new old solution for weak tournaments

نویسنده

  • Vincent Anesi
چکیده

This note uncovers new properties of the von Neumann-Morgenstern solution in weak tournaments and majoritarian games. We propose a new procedure for the construction of choice sets from weak tournaments, based on dynamic stability criteria. The idea is to analyze dynamic versions of the tournament game introduced by Laffond, Laslier and Le Breton (1993) [The bipartisan set of a tournament game. Games and Economic Behavior 5, 182-201]. The exploration of a speci c class of Markov perfect equilibria in these dynamic tournament games yields a new solution concept for weak tournaments the A-stable set. The alternatives in an A-stable set constitute persistent, long-run policy outcomes in the corresponding dynamic tournament games. We nd that, in any weak tournament, the class of A-stable sets coincides with that of von Neumann-Morgenstern stable sets. JEL classi cation: C71, C73, D72.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed refinements of Shapley's saddles and weak tournaments

We investigate refinements of two solutions, the saddle and the weak saddle, defined by Shapley (1964) for two-player zero-sum games. Applied to weak tournaments, the first refinement, the mixed saddle, is unique and gives us a new solution, generally lying between the GETCHA and GOTCHA sets of Schwartz (1972, 1986). In the absence of ties, all three solutions reduce to the usual top cycle set....

متن کامل

Hölder continuity of solution maps to a parametric weak vector equilibrium problem

In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.

متن کامل

Stable Sets of Weak Tournaments

1. Introduction :-An abiding problem in choice theory has been one of characterizing those choice functions which are obtained as a result of some kind of optimisation. Specifically, the endeavour has concentrated largely on finding a binary relation (if there be any) whose best elements coincide with observed choices. An adequate survey of this line of research till the mid eighties is availab...

متن کامل

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

متن کامل

Using necessarily weak efficient solutions for solving a biobjective transportation problem with fuzzy objective functions coefficients

This paper considers a biobjective transportation problem with various fuzzy objective functions coefficients. Fuzzy coefficients can be of different types such as triangular, trapezoidal, (semi) $L-R$, or flat (semi) $L-R$ fuzzy numbers. First, we convert the problem to a parametric interval biobjective transportation problem using $gamma$-cuts of fuzzy coefficients. Then, we consider a fix $g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Social Choice and Welfare

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2012